Interactive CSP 43 Interactive Arc - Consistency 74 A Case Study on Shape Recognition 115 Conclusions and Future Works

نویسندگان

  • Rita Cucchiara
  • Evelina Lamma
  • Paola Mello
  • Michela Milano
چکیده

We present an Interactive Constraint Satisfaction model for problems where knowledge is not completely deened at the beginning of the computation , but can be interactively acquired during the computational process. In this case, domains can be partially deened when the constraint satisfaction process starts. Thus, domains are dynamically deened in contrast with classical CSPs where domains are statically deened at the beginning of the constraint satisfaction process. The interactive CSP model copes with incomplete domain deenition by propagating constraints on already deened domain values and by adding new constraints on undeened parts of domains. These new constraints can be used to incrementally process new information without restarting a constraint propagation process from scratch each time new information is available. In addition, these constraints can be eventually used in order to guide the knowledge acquisition process. Examples are given in order to show the eeectiveness of the approach. In particular, a case study in the eld of visual object recognition is considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Art Analysis Based on Baudrillard’s Hyper reality Theory, a Case Study of Digital Interactive installation

The contemporary philosopher Jean Baudrillard, one of the postmodernism theorists, considers representation in the contemporary world as a factor in the disappearance of reality. In his view, the main feature of new arts is not the expression of artistic beauty, but communication with the audience and expression of the artist’s ideas. In interactive art, the presence and role of the audience in...

متن کامل

Arc Consistency in Binary Encodings of Non-binary CSPs: Theoretical and Experimental Evaluation

A Non-binary Constraint Satisfaction Problem (CSP) can be solved by converting the problem into an equivalent binary one and applying well-established binary CSP techniques. An alternative way is to use extended versions of binary techniques directly on the non-binary problem. There are two well-known computational methods in the literature for translating a non-binary CSP to an equivalent bina...

متن کامل

Maintaining Alternative Values in Constraint-based Configuration

Constraint programming techniques are widely used to model and solve interactive decision problems, and especially configuration problems. In this type of application, the configurable product is described by means of a set of constraints bearing on the configuration variables. The user interactively solves the CSP by assigning the variables according to her preferences. The system then has to ...

متن کامل

Explanation and Implication for Configuration Problems

In this work we explore the problem of generating explanations for configuration problems using on the constraint satisfaction (CSP) framework. In addition, we are concerned with deriving implications from user choices in order to guide selection of later choices. We show that the consistency methods used in connection with constraint processing can be used to generate inferences that support b...

متن کامل

Faster Muse Csp Arc Consistency Algorithms

MUSE CSP (MU ltiply SEgmented Constraint Satisfaction Problem) [5, 6] is an extension to the constraint satisfaction problem (CSP) which is especially useful for problems that segment into multiple instances of CSP that share variables. In Helzerman and Harper [6], the concepts of MUSE node, arc, and path consistency were de ned and algorithms for MUSE arc consistency, MUSE AC-1, and MUSE path ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997